Temporal logics with reference pointers and computation tree logics

A complete axiomatic system CTL rp is introduced for a temporal logic for nitely branching ! +-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL into CTL rp. In particular, that yields a complete axiomatization for the translations of all valid CTL-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantiiers), but in a way more expressive medium for reasoning about branching time.